493 research outputs found
A new Algorithm Based on Factorization for Heterogeneous Domain Decomposition
Often computational models are too expensive to be solved in the entire
domain of simulation, and a cheaper model would suffice away from the main zone
of interest. We present for the concrete example of an evolution problem of
advection reaction diffusion type a heterogeneous domain decomposition
algorithm which allows us to recover a solution that is very close to the
solution of the fully viscous problem, but solves only an inviscid problem in
parts of the domain. Our new algorithm is based on the factorization of the
underlying differential operator, and we therefore call it factorization
algorithm. We give a detailed error analysis, and show that we can obtain
approximations in the viscous region which are much closer to the viscous
solution in the entire domain of simulation than approximations obtained by
other heterogeneous domain decomposition algorithms from the literature.Comment: 23 page
Cross-Points in Domain Decomposition Methods with a Finite Element Discretization
Non-overlapping domain decomposition methods necessarily have to exchange
Dirichlet and Neumann traces at interfaces in order to be able to converge to
the underlying mono-domain solution. Well known such non-overlapping methods
are the Dirichlet-Neumann method, the FETI and Neumann-Neumann methods, and
optimized Schwarz methods. For all these methods, cross-points in the domain
decomposition configuration where more than two subdomains meet do not pose any
problem at the continuous level, but care must be taken when the methods are
discretized. We show in this paper two possible approaches for the consistent
discretization of Neumann conditions at cross-points in a Finite Element
setting
Optimized Schwarz Methods for Maxwell equations
Over the last two decades, classical Schwarz methods have been extended to
systems of hyperbolic partial differential equations, and it was observed that
the classical Schwarz method can be convergent even without overlap in certain
cases. This is in strong contrast to the behavior of classical Schwarz methods
applied to elliptic problems, for which overlap is essential for convergence.
Over the last decade, optimized Schwarz methods have been developed for
elliptic partial differential equations. These methods use more effective
transmission conditions between subdomains, and are also convergent without
overlap for elliptic problems. We show here why the classical Schwarz method
applied to the hyperbolic problem converges without overlap for Maxwell's
equations. The reason is that the method is equivalent to a simple optimized
Schwarz method for an equivalent elliptic problem. Using this link, we show how
to develop more efficient Schwarz methods than the classical ones for the
Maxwell's equations. We illustrate our findings with numerical results
Dirichlet-Neumann and Neumann-Neumann Waveform Relaxation for the Wave Equation
We present a Waveform Relaxation (WR) version of the Dirichlet-Neumann and
Neumann-Neumann algorithms for the wave equation in space time. Each method is
based on a non-overlapping spatial domain decomposition, and the iteration
involves subdomain solves in space time with corresponding interface condition,
followed by a correction step. Using a Laplace transform argument, for a
particular relaxation parameter, we prove convergence of both algorithms in a
finite number of steps for finite time intervals. The number of steps depends
on the size of the subdomains and the time window length on which the
algorithms are employed. We illustrate the performance of the algorithms with
numerical results, and also show a comparison with classical and optimized
Schwarz WR methods.Comment: 8 pages, 6 figures, presented in 22nd International conference on
Domain Decomposition Methods, to appear in Domain Decomposition in Science
and Engineering XXII, LNCSE, Springer-Verlag 201
- …